A Divide-and-Conquer Strategy for Parsing

Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods

This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...

Efficient parallel and incremental parsing of practical context-free languages

We present a divide-and-conquer algorithm for parsing context-free languages efficiently. Our algorithm is an instance of Valiant’s (1975), who reduced the problem of parsing to matrix multiplications. We show that, while the conquer step of Valiant’s is O(n), it improves to O(log n) under certain conditions satisfied by many useful inputs, and if one uses a sparse representation of matrices. T...

Divide-and-Conquer Parsing for Parallelism and Laziness

Kinematic Identification of Parallel Mechanisms by a Divide and Conquer Strategy

This paper presents a Divide and Conquer strategy to estimate the kinematic parameters of parallel symmetrical mechanisms. The Divide and Conquer kinematic identification is designed and performed independently for each leg of the mechanism. The estimation of the kinematic parameters is performed using the inverse calibration method. The identification poses are selected optimizing the observab...

A Shallow Text Processing Core Engine

In this paper we present sppc, a high-performance system for intelligent extraction of structured data from free text documents. sppc consists of a set of domain-adaptive shallow core components that are realized by means of cascaded weighted finite state machines and generic dynamic tries. The system has been fully implemented for German; it includes morphological and on-line compound analysis...